Maximum hypergraphs without regular subgraphs
نویسندگان
چکیده
We show that an n-vertex hypergraph with no r-regular subgraph has at most 2n−1 + r− 2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraph having the maximum number of edges contains a full star, that is, 2n−1 distinct edges containing a given vertex. We prove this conjecture for n ≥ 425. The condition that n > r cannot be weakened.
منابع مشابه
Two-regular subgraphs of hypergraphs
We prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing no 2-regular subhypergraph is ( n−1 k−1 ) if k ≥ 4 is even and n is sufficiently large. Equality holds only if all edges contain a specific vertex v. For odd k we conjecture that this maximum is ( n−1 k−1 ) + bn−1 k c, with equality only for the hypergraph described above plus a maximum matching omittin...
متن کاملSupersaturated graphs and hypergraphs
We shall consider graphs (hypergraphs) without loops and multiple edges . Let Ybe a family of so called prohibited graphs and ex (n, Y) denote the maximum number of edges (hyperedges) a graph (hypergraph) on n vertices can have without containing subgraphs from Y A graph (hypergraph) will be called supersaturated if it has more edges than ex (n, Y). If G has n vertices and ex (n, Y)=k edges (hy...
متن کاملOn Lagrangians of Hypergraphs Containing Dense Subgraphs
Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide upper bounds on the Lagrangian of a hypergr...
متن کامل3-star Factors in Random D-regular Graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been used to study the almost sure existence of, and the asymptotic distribution of, regular spanning subgraphs of various types in random d-regular graphs and hypergraphs. In this paper, we use the method to prove the almos...
متن کاملEquicovering Subgraphs of Graphs and Hypergraphs
As a variation on the t-Equal Union Property (t-EUP) introduced by Lindström, we introduce the t-Equal Valence Property (t-EVP) for hypergraphs: a hypergraph satisfies the t-EVP if there are t pairwise edge-disjoint subhypergraphs such that for each vertex v, the degree of v in all t subhypergraphs is the same. In the t-EUP, the subhypergraphs just have the same sets of vertices with positive d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2014